/**
 * 
 */
package niuke.shenxinfu;

import java.util.Arrays;
import java.util.Scanner;

/**
 * @author zhongfang
 *
 */
public class 判断三角形 {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		String[] strings = scanner.nextLine().split(",");
		scanner.close();
		double[] a = new double[3];
		for (int i = 0; i < 3; i++) {
			a[i] = Double.parseDouble(strings[i]);
		}
		Arrays.sort(a);
		if (a[2] >= a[0] + a[1]) {
			System.out.println("Unable");
		} else if (a[0] == a[1] && a[1] == a[2]) {
			System.out.println("Equilateral");
		} else if (a[0] == a[1] || a[1] == a[2]) {
			System.out.println("Isoceles");
		} else if (a[0] * a[0] + a[1] * a[1] == a[2] * a[2]) {
			System.out.println("Right-angled");
		} else {
			System.out.println("General");
		}
	}

}
